Emotion Oriented Programming: Computational Abstractions for AI Problem Solving

In this paper, we present a programming paradigm for AI problem solving based on computational concepts drawn from Affective Computing. It is believed that emotions participate in human adaptability and reactivity, in behaviour selection and in complex and dynamic environments. We propose to define a mechanism inspired from this observation for general AI problem solving. To this purpose, we synthesize emotions as programming abstractions that represent the perception of the environment’s state w.r.t. predefined heuristics such as goal distance, action capability, etc. We first describe the general architecture of this “emotion-oriented” programming model. We define the vocabulary that allows programmers to describe the problem to be solved (i.e. the environment), and the action selection function based on emotion abstractions (i.e. the agent’s behaviours). We then present the runtime algorithm that builds emotions out of the environment, stores them in the agent’s memory, and selects behaviours accordingly. We present the implementation of a classical labyrinth problem solver in this model. We show that the solutions obtained by this easy-to-implement emotionoriented program are of good quality while having a reduced computational cost.